Agreement in the Presence of Faults, on Networks of Bounded Degree
نویسندگان
چکیده
We present networks of bounded degree and a fully polynomial almost everywhere agreement scheme which tolerate, with high probability, randomly located faulty processors, where processors fail independently with some constant probability.
منابع مشابه
Efficient broadcasting with linearly bounded faults I*,
We consider the problem of broadcasting in the presence of linearly bounded number of transient faults. For some fixed 0 <IX < 1 we assume that at most zi faulty transmissions can occur during the first i time units of the broadcasting algorithm execution, for every natural i. In a unit of time every node can communicate with at most one neighbor. We prove that some bounded degree networks are ...
متن کاملDetection of fault segments based on P–T dihedra analysis along the North Tabriz fault, NW Iran
Detection of fault segments is an essential step for tracking main transverse faults. General observations from field studies as well as attitude measurements can give an overall understanding of the lengths of the segments, but these are not always sufficient to accurately identify and characterize them. In this study, we analyze P–T dihedra variations based on their eigenvalues to detect faul...
متن کاملCross Entropy-Based High-Impedance Fault Detection Algorithm for Distribution Networks
The low fault current of high-impedance faults (HIFs) is one of the main challenges for the protection of distribution networks. The inability of conventional overcurrent relays in detecting these faults results in electric arc continuity that it causes the fire hazard and electric shock and poses a serious threat to human life and network equipment. This paper presents an HIF detection algori...
متن کاملFault Identification using end-to-end data by imperialist competitive algorithm
Faults in computer networks may result in millions of dollars in cost. Faults in a network need to be localized and repaired to keep the health of the network. Fault management systems are used to keep today’s complex networks running without significant cost, either by using active techniques or passive techniques. In this paper, we propose a novel approach based on imperialist competitive alg...
متن کاملOn the Fault Tolerance of Some Popular Bounded-Degree Networks
In this paper, we analyze the fault tolerance of several bounded-degree networks that are commonly used for parallel computation. Among other things, we show that an N-node butterry network containing N 1? worst-case faults (for any constant > 0) can emulate a fault-free butterry of the same size with only constant slowdown. The same result is proved for the shuue-exchange network. Hence, these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 57 شماره
صفحات -
تاریخ انتشار 1996